<HTML><HEAD><TITLE>library(m_tree234)</TITLE></HEAD><BODY>
[ <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]<H1>library(m_tree234)</H1>
A map (dictionary) implemented using 2-3-4 trees
<H2>Predicates</H2>
<BLOCKQUOTE>
<DL>
<DT><A HREF="assoc_list_to_tree234-2.html"><STRONG>assoc_list_to_tree234(+AssocList, -Tree)</STRONG></A></DT>
<DD>Converts an association list into a tree.</DD>
<DT><A HREF="count-2.html"><STRONG>count(+Tree, ?Count)</STRONG></A></DT>
<DD>Count the number of elements in a tree.</DD>
<DT><A HREF="delete-3.html"><STRONG>delete(+Tree0, ++Key, -Tree)</STRONG></A></DT>
<DD>Delete a key/value pair from a tree.</DD>
<DT><A HREF="init-1.html"><STRONG>init(-Tree)</STRONG></A></DT>
<DD>Initialise a new (empty) 2-3-4 tree.</DD>
<DT><A HREF="insert-4.html"><STRONG>insert(+Tree0, ++Key, ?Value, -Tree)</STRONG></A></DT>
<DD>Insert a key/value pair into a tree, failing if the key already exists.</DD>
<DT><A HREF="is_empty-1.html"><STRONG>is_empty(+Tree)</STRONG></A></DT>
<DD>Check whether a tree is empty.</DD>
<DT><A HREF="keys-2.html"><STRONG>keys(+Tree, -KeyList)</STRONG></A></DT>
<DD>Return all the keys from a tree.</DD>
<DT><A HREF="lookup-3.html"><STRONG>lookup(+Tree, ++Key, ?Value)</STRONG></A></DT>
<DD>Search a tree for a key.</DD>
<DT><A HREF="lower_bound_lookup-4.html"><STRONG>lower_bound_lookup(+Tree, ++SearchKey, ?Key, ?Value)</STRONG></A></DT>
<DD>Search a tree for the smallest key no smaller than SearchKey.</DD>
<DT><A HREF="lower_bound_search-4.html"><STRONG>lower_bound_search(+Tree, ++SearchKey, ?Key, ?Value)</STRONG></A></DT>
<DD>Search a tree for the smallest key no smaller than SearchKey.</DD>
<DT><A HREF="member-3.html"><STRONG>member(+Tree, ?Key, ?Value)</STRONG></A></DT>
<DD>Succeeds if Key and Value unify with a key/value pair from Tree.</DD>
<DT><A HREF="remove-4.html"><STRONG>remove(+Tree0, ++Key, ?Value, -Tree)</STRONG></A></DT>
<DD>Remove a key/value pair from a tree, failing if the key is not present.</DD>
<DT><A HREF="remove_smallest-4.html"><STRONG>remove_smallest(+Tree0, ?Key, ?Value, -Tree)</STRONG></A></DT>
<DD>Remove the smallest key and its corresponding value from a tree.</DD>
<DT><A HREF="search-3.html"><STRONG>search(+Tree, ++Key, ?Value)</STRONG></A></DT>
<DD>Search a tree for a key.</DD>
<DT><A HREF="set-4.html"><STRONG>set(+Tree0, ++Key, ?Value, -Tree)</STRONG></A></DT>
<DD>Update the value corresponding to a key in a tree, inserting the key if it doesn't exist already.</DD>
<DT><A HREF="tree234_to_assoc_list-2.html"><STRONG>tree234_to_assoc_list(+Tree, -AssocList)</STRONG></A></DT>
<DD>Converts a tree into an association list.</DD>
<DT><A HREF="update-4.html"><STRONG>update(+Tree0, ++Key, ?Value, -Tree)</STRONG></A></DT>
<DD>Update the value corresponding to a key in a tree.</DD>
<DT><A HREF="upper_bound_lookup-4.html"><STRONG>upper_bound_lookup(+Tree, ++SearchKey, ?Key, ?Value)</STRONG></A></DT>
<DD>Search a tree for the largest key no larger than SearchKey.</DD>
<DT><A HREF="upper_bound_search-4.html"><STRONG>upper_bound_search(+Tree, ++SearchKey, ?Key, ?Value)</STRONG></A></DT>
<DD>Search a tree for the largest key no larger than SearchKey.</DD>
<DT><A HREF="values-2.html"><STRONG>values(+Tree, -ValueList)</STRONG></A></DT>
<DD>Return all the values from a tree.</DD>
</DL>
</BLOCKQUOTE>
<H2>Description</H2>
	<P>
	This module implements 2-3-4 trees.  They can be used to manage and
	index a collection of key/value pairs.  You probably want to use the
	interface provided by `map.pl' instead of using this module
	directly.
	</P>
	<P>
	Note that keys must be ground, but values are allowed to be
	variables.
	</P>
	
<H2>About</H2><UL COMPACT>
<LI><STRONG>Author: </STRONG>Thomas Conway (Mercury) and Warwick Harvey (ECLiPSe)
</UL>
<HR>Generated from m_tree234.eci on 2009-05-27 01:25
</BODY></HTML>
